-
1 disconnected graph
несвязный граф
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > disconnected graph
-
2 disconnected graph
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > disconnected graph
-
3 disconnected graph
Большой англо-русский и русско-английский словарь > disconnected graph
-
4 disconnected graph
1) Математика: несвязный граф2) Микроэлектроника: несвязанный граф -
5 disconnected graph
мат. -
6 disconnected graph
-
7 totally disconnected graph
Математика: вполне несвязный графУниверсальный англо-русский словарь > totally disconnected graph
-
8 weakly disconnected graph
Математика: слабо несвязный графУниверсальный англо-русский словарь > weakly disconnected graph
-
9 totally disconnected graph
English-Russian scientific dictionary > totally disconnected graph
-
10 weakly disconnected graph
English-Russian scientific dictionary > weakly disconnected graph
-
11 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
12 graph
1) график, диаграммасм. тж. area graph, bar graph, business graphics, diagram, line graph, logarithmic graph, pie graph, ribbon graph, x-y graph2) графматематический объект, представляющий собой конечное множество вершин (node), соединённых рёбрами (edge), или дугами (arc). И тем и другим могут быть сопоставлены атрибуты, а дугам предписаны направления, в этом случае граф называется ориентированным, или орграфомсм. тж. acyclic graph, antisymmetric graph, bigraph, CFG, complete graph, DAG, diameter of graph, directed graph, directed multigraph, disconnected graph, empty graph, graph theory, hypergraph, labeled graph, mixed graph, multigraph, planar graph, random graph, simple circuit, task graph, trivial graphАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > graph
-
13 empty graph
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > empty graph
-
14 несвязный граф
Большой англо-русский и русско-английский словарь > несвязный граф
-
15 path
1) путь; трасса2) траектория3) канал; тракт4) дорожка ( магнитной ленты)5) вчт ветвь (программы)6) цепь ( в электрической схеме)7) путь доступа8) контур•- path of a projectile- ray path
См. также в других словарях:
Graph automorphism — In graph theoretical mathematics, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge vertex connectivity.Formally, an automorphism of a graph G = ( V , E ) is a permutation sigma;… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular … Wikipedia
Regular graph — In graph theory, a regular graph is a graph where each vertex has the same number of neighbors, i.e. every vertex has the same degree or valency. A regular graph with vertices of degree k is called a kregular graph or regular graph of degree… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Cayley graph — In mathematics, the Cayley graph, also known as the Cayley colour graph, is the graph that encodes the structure of a discrete group. Its definition is suggested by Cayley s theorem (named after Arthur Cayley) and uses a particular, usually… … Wikipedia
Chordal graph — A cycle (black) with two chords (green). As for this part, the graph is chordal. However, removing one green edge would result in a non chordal graph. Indeed, the other green edge with three black edges would form a cycle of length four with no… … Wikipedia